Independent pairs of good self-dual codes

نویسنده

  • William M. Kantor
چکیده

011 R. Ash, Information Theory. New York: Wiley, 1965. R. J. McEliece, The Theory of Information and Coding. London: Addison-Wesley, 1917. D. Middleton, An Introduction to Statistical Communicat ion Theory. New York: McGraw-Hill, 1960. M. R. D’Amato, Experimental Psychology: Methodology, Psychophysics, and Learning. New York: McGraw-Hill, 1970. P. J. Barber and D. Legge, Perception and Information. London: Methuen. 1976. T. B. Sheridan and W . R. Ferrell, Man-Machine Systems: Information, Control and Decision Models of Human Performance. Cambridge, MA: MIT, 1974. T. 0. Kv.%lseth, “Note on information capacity of discrete motor remanses,” Percevt. Motor Skills. vol. 49. DD. 291-296. 1979. 1, “Test of-the 10 bits/set channel~capacity hypothesis for human tracking,” Appl. Math. Model., vol. 3, pp. 307-308, 1979.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

An Efficient Construction of Self-Dual Codes

We complete the building-up construction for self-dual codes by resolving the open cases over GF (q) with q ≡ 3 (mod 4), and over Zpm and Galois rings GR(p, r) with an odd prime p satisfying p ≡ 3 (mod 4) with r odd. We also extend the buildingup construction for self-dual codes to finite chain rings. Our building-up construction produces many new interesting self-dual codes. In particular, we ...

متن کامل

Transitive and Self-dual Codes Attaining the Tsfasman-vladut-zink Bound

A major problem in coding theory is the question if the class of cyclic codes is asymptotically good. In this paper we introduce as a generalization of cyclic codes the notion of transitive codes (see Definition 1.4 in Section 1), and we show that the class of transitive codes is asymptotically good. Even more, transitive codes attain the Tsfasman-Vladut-Zink bound over Fq, for all squares q = ...

متن کامل

Self-Dual Cyclic and Quantum Codes Over Z2^{\alpha} x (Z2 + uZ2)^{\beta}

In this paper we introduce self-dual cyclic and quantum codes over Zα2 × (Z2 + uZ2) . We determine the conditions for any Z2Z2[u]-cyclic code to be self-dual, that is, C = C. Since the binary image of a selforthogonal Z2Z2[u]-linear code is also a self-orthogonal binary linear code, we introduce quantum codes over Zα2 × (Z2 + uZ2) β . Finally, we present some examples of self-dual cyclic and qu...

متن کامل

Hermitian self-dual quasi-abelian codes

Quasi-abelian codes constitute an important class of linear codes containing theoretically and practically interesting codes such as quasi-cyclic codes, abelian codes, and cyclic codes. In particular, the sub-class consisting of 1-generator quasi-abelian codes contains large families of good codes. Based on the well-known decomposition of quasi-abelian codes, the characterization and enumeratio...

متن کامل

Some Generalizations of Good Integers and Their Applications in the Study of Self-Dual Negacyclic Codes

Good integers introduced in 1997 form an interesting family of integers that has been continuously studied due to their rich number theoretical properties and wide applications. In this paper, we have focused on classes of 2β-good integers, 2β-oddlygood integers, and 2β-evenly-good integers which are generalizations of good integers. Properties of such integers have been given as well as their ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 28  شماره 

صفحات  -

تاریخ انتشار 1982